Scheduling games on uniform machines with activation cost

Cost-Sharing Scheduling Games on Restricted Unrelated Machines

We study a very general cost-sharing scheduling game. An instance consists of k jobs and m machines and an arbitrary weighted bipartite graph denoting the jobs strategies. An edge connecting a job and a machine specifies that the job may choose the machine; edge weights correspond to processing times. Each machine has an activation cost that needs to be covered by the job assigned to it. Jobs a...

Scheduling on Uniform Nonsimultaneous Parallel Machines

We consider the problem of scheduling on uniform processors which may not start processing at the same time with the purpose of minimizing the maximum completion time. We give a variant of the Multifit algorithm which generates schedules which end within 1.382 times the optimal maximum completion time for the general problem, and within √ 6/2 times the optimal maximum completion time for proble...

Scheduling two interfering job sets on uniform parallel machines with makespan and cost functions

We consider a m uniform parallel machines scheduling problem with two jobs A and B with nA and nB operations, respectively, and equal processing times. Job A is associated with a general cost function F, whereas makespan is considered for job B. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for F and C max criteria. We also tackle some part...

Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

We consider the problem of scheduling n jobs on m parallel machines. Each job has a deterministic processing time and a weight associated with it. For uniform machines we show that discounted flowtime is minimized by serving jobs preemptively in increasing order of their remaining processing times, assigning the job with the shortest remaining processing time to the fastest available machine. 2...

Ordinal On-Line Scheduling on Two Uniform Machines